Termination w.r.t. Q proof of TRS/AG01#3.55.trs

Termination w.r.t. Q of the following Term Rewriting System could be proven:

Q restricted rewrite system:
The TRS R consists of the following rules:

minus₂(x, 0) -> x
minus₂(s₁(x), s₁(y)) -> minus₂(x, y)
quot₂(0, s₁(y)) -> 0
quot₂(s₁(x), s₁(y)) -> s₁(quot₂(minus₂(x, y), s₁(y)))
le₂(0, y) -> true
le₂(s₁(x), 0) -> false
le₂(s₁(x), s₁(y)) -> le₂(x, y)
app₂(nil, y) -> y
app₂(add₂(n, x), y) -> add₂(n, app₂(x, y))
low₂(n, nil) -> nil
low₂(n, add₂(m, x)) -> if_low₃(le₂(m, n), n, add₂(m, x))
if_low₃(true, n, add₂(m, x)) -> add₂(m, low₂(n, x))
if_low₃(false, n, add₂(m, x)) -> low₂(n, x)
high₂(n, nil) -> nil
high₂(n, add₂(m, x)) -> if_high₃(le₂(m, n), n, add₂(m, x))
if_high₃(true, n, add₂(m, x)) -> high₂(n, x)
if_high₃(false, n, add₂(m, x)) -> add₂(m, high₂(n, x))
quicksort₁(nil) -> nil
quicksort₁(add₂(n, x)) -> app₂(quicksort₁(low₂(n, x)), add₂(n, quicksort₁(high₂(n, x))))

Q is empty.

↳ QTRS

  ↳ DependencyPairsProof

Q restricted rewrite system:
The TRS R consists of the following rules:

minus₂(x, 0) -> x
minus₂(s₁(x), s₁(y)) -> minus₂(x, y)
quot₂(0, s₁(y)) -> 0
quot₂(s₁(x), s₁(y)) -> s₁(quot₂(minus₂(x, y), s₁(y)))
le₂(0, y) -> true
le₂(s₁(x), 0) -> false
le₂(s₁(x), s₁(y)) -> le₂(x, y)
app₂(nil, y) -> y
app₂(add₂(n, x), y) -> add₂(n, app₂(x, y))
low₂(n, nil) -> nil
low₂(n, add₂(m, x)) -> if_low₃(le₂(m, n), n, add₂(m, x))
if_low₃(true, n, add₂(m, x)) -> add₂(m, low₂(n, x))
if_low₃(false, n, add₂(m, x)) -> low₂(n, x)
high₂(n, nil) -> nil
high₂(n, add₂(m, x)) -> if_high₃(le₂(m, n), n, add₂(m, x))
if_high₃(true, n, add₂(m, x)) -> high₂(n, x)
if_high₃(false, n, add₂(m, x)) -> add₂(m, high₂(n, x))
quicksort₁(nil) -> nil
quicksort₁(add₂(n, x)) -> app₂(quicksort₁(low₂(n, x)), add₂(n, quicksort₁(high₂(n, x))))

Q is empty.

Using Dependency Pairs [1,13] we result in the following initial DP problem:
Q DP problem:
The TRS P consists of the following rules:

QUOT₂(s₁(x), s₁(y)) -> QUOT₂(minus₂(x, y), s₁(y))
QUICKSORT₁(add₂(n, x)) -> APP₂(quicksort₁(low₂(n, x)), add₂(n, quicksort₁(high₂(n, x))))
IF_HIGH₃(false, n, add₂(m, x)) -> HIGH₂(n, x)
QUICKSORT₁(add₂(n, x)) -> QUICKSORT₁(low₂(n, x))
QUICKSORT₁(add₂(n, x)) -> QUICKSORT₁(high₂(n, x))
QUICKSORT₁(add₂(n, x)) -> HIGH₂(n, x)
MINUS₂(s₁(x), s₁(y)) -> MINUS₂(x, y)
QUOT₂(s₁(x), s₁(y)) -> MINUS₂(x, y)
LOW₂(n, add₂(m, x)) -> LE₂(m, n)
LOW₂(n, add₂(m, x)) -> IF_LOW₃(le₂(m, n), n, add₂(m, x))
HIGH₂(n, add₂(m, x)) -> IF_HIGH₃(le₂(m, n), n, add₂(m, x))
LE₂(s₁(x), s₁(y)) -> LE₂(x, y)
QUICKSORT₁(add₂(n, x)) -> LOW₂(n, x)
HIGH₂(n, add₂(m, x)) -> LE₂(m, n)
IF_LOW₃(true, n, add₂(m, x)) -> LOW₂(n, x)
IF_LOW₃(false, n, add₂(m, x)) -> LOW₂(n, x)
IF_HIGH₃(true, n, add₂(m, x)) -> HIGH₂(n, x)
APP₂(add₂(n, x), y) -> APP₂(x, y)

The TRS R consists of the following rules:

minus₂(x, 0) -> x
minus₂(s₁(x), s₁(y)) -> minus₂(x, y)
quot₂(0, s₁(y)) -> 0
quot₂(s₁(x), s₁(y)) -> s₁(quot₂(minus₂(x, y), s₁(y)))
le₂(0, y) -> true
le₂(s₁(x), 0) -> false
le₂(s₁(x), s₁(y)) -> le₂(x, y)
app₂(nil, y) -> y
app₂(add₂(n, x), y) -> add₂(n, app₂(x, y))
low₂(n, nil) -> nil
low₂(n, add₂(m, x)) -> if_low₃(le₂(m, n), n, add₂(m, x))
if_low₃(true, n, add₂(m, x)) -> add₂(m, low₂(n, x))
if_low₃(false, n, add₂(m, x)) -> low₂(n, x)
high₂(n, nil) -> nil
high₂(n, add₂(m, x)) -> if_high₃(le₂(m, n), n, add₂(m, x))
if_high₃(true, n, add₂(m, x)) -> high₂(n, x)
if_high₃(false, n, add₂(m, x)) -> add₂(m, high₂(n, x))
quicksort₁(nil) -> nil
quicksort₁(add₂(n, x)) -> app₂(quicksort₁(low₂(n, x)), add₂(n, quicksort₁(high₂(n, x))))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

Q DP problem:
The TRS P consists of the following rules:

QUOT₂(s₁(x), s₁(y)) -> QUOT₂(minus₂(x, y), s₁(y))
QUICKSORT₁(add₂(n, x)) -> APP₂(quicksort₁(low₂(n, x)), add₂(n, quicksort₁(high₂(n, x))))
IF_HIGH₃(false, n, add₂(m, x)) -> HIGH₂(n, x)
QUICKSORT₁(add₂(n, x)) -> QUICKSORT₁(low₂(n, x))
QUICKSORT₁(add₂(n, x)) -> QUICKSORT₁(high₂(n, x))
QUICKSORT₁(add₂(n, x)) -> HIGH₂(n, x)
MINUS₂(s₁(x), s₁(y)) -> MINUS₂(x, y)
QUOT₂(s₁(x), s₁(y)) -> MINUS₂(x, y)
LOW₂(n, add₂(m, x)) -> LE₂(m, n)
LOW₂(n, add₂(m, x)) -> IF_LOW₃(le₂(m, n), n, add₂(m, x))
HIGH₂(n, add₂(m, x)) -> IF_HIGH₃(le₂(m, n), n, add₂(m, x))
LE₂(s₁(x), s₁(y)) -> LE₂(x, y)
QUICKSORT₁(add₂(n, x)) -> LOW₂(n, x)
HIGH₂(n, add₂(m, x)) -> LE₂(m, n)
IF_LOW₃(true, n, add₂(m, x)) -> LOW₂(n, x)
IF_LOW₃(false, n, add₂(m, x)) -> LOW₂(n, x)
IF_HIGH₃(true, n, add₂(m, x)) -> HIGH₂(n, x)
APP₂(add₂(n, x), y) -> APP₂(x, y)

The TRS R consists of the following rules:

minus₂(x, 0) -> x
minus₂(s₁(x), s₁(y)) -> minus₂(x, y)
quot₂(0, s₁(y)) -> 0
quot₂(s₁(x), s₁(y)) -> s₁(quot₂(minus₂(x, y), s₁(y)))
le₂(0, y) -> true
le₂(s₁(x), 0) -> false
le₂(s₁(x), s₁(y)) -> le₂(x, y)
app₂(nil, y) -> y
app₂(add₂(n, x), y) -> add₂(n, app₂(x, y))
low₂(n, nil) -> nil
low₂(n, add₂(m, x)) -> if_low₃(le₂(m, n), n, add₂(m, x))
if_low₃(true, n, add₂(m, x)) -> add₂(m, low₂(n, x))
if_low₃(false, n, add₂(m, x)) -> low₂(n, x)
high₂(n, nil) -> nil
high₂(n, add₂(m, x)) -> if_high₃(le₂(m, n), n, add₂(m, x))
if_high₃(true, n, add₂(m, x)) -> high₂(n, x)
if_high₃(false, n, add₂(m, x)) -> add₂(m, high₂(n, x))
quicksort₁(nil) -> nil
quicksort₁(add₂(n, x)) -> app₂(quicksort₁(low₂(n, x)), add₂(n, quicksort₁(high₂(n, x))))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The approximation of the Dependency Graph [13,14,18] contains 7 SCCs with 6 less nodes.

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

        ↳ AND

          ↳ QDP

            ↳ QDPOrderProof

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

APP₂(add₂(n, x), y) -> APP₂(x, y)

The TRS R consists of the following rules:

minus₂(x, 0) -> x
minus₂(s₁(x), s₁(y)) -> minus₂(x, y)
quot₂(0, s₁(y)) -> 0
quot₂(s₁(x), s₁(y)) -> s₁(quot₂(minus₂(x, y), s₁(y)))
le₂(0, y) -> true
le₂(s₁(x), 0) -> false
le₂(s₁(x), s₁(y)) -> le₂(x, y)
app₂(nil, y) -> y
app₂(add₂(n, x), y) -> add₂(n, app₂(x, y))
low₂(n, nil) -> nil
low₂(n, add₂(m, x)) -> if_low₃(le₂(m, n), n, add₂(m, x))
if_low₃(true, n, add₂(m, x)) -> add₂(m, low₂(n, x))
if_low₃(false, n, add₂(m, x)) -> low₂(n, x)
high₂(n, nil) -> nil
high₂(n, add₂(m, x)) -> if_high₃(le₂(m, n), n, add₂(m, x))
if_high₃(true, n, add₂(m, x)) -> high₂(n, x)
if_high₃(false, n, add₂(m, x)) -> add₂(m, high₂(n, x))
quicksort₁(nil) -> nil
quicksort₁(add₂(n, x)) -> app₂(quicksort₁(low₂(n, x)), add₂(n, quicksort₁(high₂(n, x))))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13].

The following pairs can be oriented strictly and are deleted.

APP₂(add₂(n, x), y) -> APP₂(x, y)

The remaining pairs can at least be oriented weakly.
none
Used ordering: Polynomial interpretation [21]:

POL(APP₂(x₁, x₂)) = x₁
POL(add₂(x₁, x₂)) = 1 + x₂

The following usable rules [14] were oriented: none

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

        ↳ AND

          ↳ QDP

            ↳ QDPOrderProof

              ↳ QDP

                ↳ PisEmptyProof

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

Q DP problem:
P is empty.
The TRS R consists of the following rules:

minus₂(x, 0) -> x
minus₂(s₁(x), s₁(y)) -> minus₂(x, y)
quot₂(0, s₁(y)) -> 0
quot₂(s₁(x), s₁(y)) -> s₁(quot₂(minus₂(x, y), s₁(y)))
le₂(0, y) -> true
le₂(s₁(x), 0) -> false
le₂(s₁(x), s₁(y)) -> le₂(x, y)
app₂(nil, y) -> y
app₂(add₂(n, x), y) -> add₂(n, app₂(x, y))
low₂(n, nil) -> nil
low₂(n, add₂(m, x)) -> if_low₃(le₂(m, n), n, add₂(m, x))
if_low₃(true, n, add₂(m, x)) -> add₂(m, low₂(n, x))
if_low₃(false, n, add₂(m, x)) -> low₂(n, x)
high₂(n, nil) -> nil
high₂(n, add₂(m, x)) -> if_high₃(le₂(m, n), n, add₂(m, x))
if_high₃(true, n, add₂(m, x)) -> high₂(n, x)
if_high₃(false, n, add₂(m, x)) -> add₂(m, high₂(n, x))
quicksort₁(nil) -> nil
quicksort₁(add₂(n, x)) -> app₂(quicksort₁(low₂(n, x)), add₂(n, quicksort₁(high₂(n, x))))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The TRS P is empty. Hence, there is no (P,Q,R) chain.

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

        ↳ AND

          ↳ QDP

          ↳ QDP

            ↳ QDPOrderProof

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

LE₂(s₁(x), s₁(y)) -> LE₂(x, y)

The TRS R consists of the following rules:

minus₂(x, 0) -> x
minus₂(s₁(x), s₁(y)) -> minus₂(x, y)
quot₂(0, s₁(y)) -> 0
quot₂(s₁(x), s₁(y)) -> s₁(quot₂(minus₂(x, y), s₁(y)))
le₂(0, y) -> true
le₂(s₁(x), 0) -> false
le₂(s₁(x), s₁(y)) -> le₂(x, y)
app₂(nil, y) -> y
app₂(add₂(n, x), y) -> add₂(n, app₂(x, y))
low₂(n, nil) -> nil
low₂(n, add₂(m, x)) -> if_low₃(le₂(m, n), n, add₂(m, x))
if_low₃(true, n, add₂(m, x)) -> add₂(m, low₂(n, x))
if_low₃(false, n, add₂(m, x)) -> low₂(n, x)
high₂(n, nil) -> nil
high₂(n, add₂(m, x)) -> if_high₃(le₂(m, n), n, add₂(m, x))
if_high₃(true, n, add₂(m, x)) -> high₂(n, x)
if_high₃(false, n, add₂(m, x)) -> add₂(m, high₂(n, x))
quicksort₁(nil) -> nil
quicksort₁(add₂(n, x)) -> app₂(quicksort₁(low₂(n, x)), add₂(n, quicksort₁(high₂(n, x))))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13].

The following pairs can be oriented strictly and are deleted.

LE₂(s₁(x), s₁(y)) -> LE₂(x, y)

The remaining pairs can at least be oriented weakly.
none
Used ordering: Polynomial interpretation [21]:

POL(LE₂(x₁, x₂)) = x₁
POL(s₁(x₁)) = 1 + x₁

The following usable rules [14] were oriented: none

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

        ↳ AND

          ↳ QDP

          ↳ QDP

            ↳ QDPOrderProof

              ↳ QDP

                ↳ PisEmptyProof

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

Q DP problem:
P is empty.
The TRS R consists of the following rules:

minus₂(x, 0) -> x
minus₂(s₁(x), s₁(y)) -> minus₂(x, y)
quot₂(0, s₁(y)) -> 0
quot₂(s₁(x), s₁(y)) -> s₁(quot₂(minus₂(x, y), s₁(y)))
le₂(0, y) -> true
le₂(s₁(x), 0) -> false
le₂(s₁(x), s₁(y)) -> le₂(x, y)
app₂(nil, y) -> y
app₂(add₂(n, x), y) -> add₂(n, app₂(x, y))
low₂(n, nil) -> nil
low₂(n, add₂(m, x)) -> if_low₃(le₂(m, n), n, add₂(m, x))
if_low₃(true, n, add₂(m, x)) -> add₂(m, low₂(n, x))
if_low₃(false, n, add₂(m, x)) -> low₂(n, x)
high₂(n, nil) -> nil
high₂(n, add₂(m, x)) -> if_high₃(le₂(m, n), n, add₂(m, x))
if_high₃(true, n, add₂(m, x)) -> high₂(n, x)
if_high₃(false, n, add₂(m, x)) -> add₂(m, high₂(n, x))
quicksort₁(nil) -> nil
quicksort₁(add₂(n, x)) -> app₂(quicksort₁(low₂(n, x)), add₂(n, quicksort₁(high₂(n, x))))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The TRS P is empty. Hence, there is no (P,Q,R) chain.

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

        ↳ AND

          ↳ QDP

          ↳ QDP

          ↳ QDP

            ↳ QDPOrderProof

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

IF_HIGH₃(false, n, add₂(m, x)) -> HIGH₂(n, x)
HIGH₂(n, add₂(m, x)) -> IF_HIGH₃(le₂(m, n), n, add₂(m, x))
IF_HIGH₃(true, n, add₂(m, x)) -> HIGH₂(n, x)

The TRS R consists of the following rules:

minus₂(x, 0) -> x
minus₂(s₁(x), s₁(y)) -> minus₂(x, y)
quot₂(0, s₁(y)) -> 0
quot₂(s₁(x), s₁(y)) -> s₁(quot₂(minus₂(x, y), s₁(y)))
le₂(0, y) -> true
le₂(s₁(x), 0) -> false
le₂(s₁(x), s₁(y)) -> le₂(x, y)
app₂(nil, y) -> y
app₂(add₂(n, x), y) -> add₂(n, app₂(x, y))
low₂(n, nil) -> nil
low₂(n, add₂(m, x)) -> if_low₃(le₂(m, n), n, add₂(m, x))
if_low₃(true, n, add₂(m, x)) -> add₂(m, low₂(n, x))
if_low₃(false, n, add₂(m, x)) -> low₂(n, x)
high₂(n, nil) -> nil
high₂(n, add₂(m, x)) -> if_high₃(le₂(m, n), n, add₂(m, x))
if_high₃(true, n, add₂(m, x)) -> high₂(n, x)
if_high₃(false, n, add₂(m, x)) -> add₂(m, high₂(n, x))
quicksort₁(nil) -> nil
quicksort₁(add₂(n, x)) -> app₂(quicksort₁(low₂(n, x)), add₂(n, quicksort₁(high₂(n, x))))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13].

The following pairs can be oriented strictly and are deleted.

IF_HIGH₃(false, n, add₂(m, x)) -> HIGH₂(n, x)
IF_HIGH₃(true, n, add₂(m, x)) -> HIGH₂(n, x)

The remaining pairs can at least be oriented weakly.

HIGH₂(n, add₂(m, x)) -> IF_HIGH₃(le₂(m, n), n, add₂(m, x))

Used ordering: Polynomial interpretation [21]:

POL(0) = 0
POL(HIGH₂(x₁, x₂)) = x₂
POL(IF_HIGH₃(x₁, x₂, x₃)) = x₃
POL(add₂(x₁, x₂)) = 1 + x₂
POL(false) = 0
POL(le₂(x₁, x₂)) = 0
POL(s₁(x₁)) = 0
POL(true) = 0

The following usable rules [14] were oriented: none

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

        ↳ AND

          ↳ QDP

          ↳ QDP

          ↳ QDP

            ↳ QDPOrderProof

              ↳ QDP

                ↳ DependencyGraphProof

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

HIGH₂(n, add₂(m, x)) -> IF_HIGH₃(le₂(m, n), n, add₂(m, x))

The TRS R consists of the following rules:

minus₂(x, 0) -> x
minus₂(s₁(x), s₁(y)) -> minus₂(x, y)
quot₂(0, s₁(y)) -> 0
quot₂(s₁(x), s₁(y)) -> s₁(quot₂(minus₂(x, y), s₁(y)))
le₂(0, y) -> true
le₂(s₁(x), 0) -> false
le₂(s₁(x), s₁(y)) -> le₂(x, y)
app₂(nil, y) -> y
app₂(add₂(n, x), y) -> add₂(n, app₂(x, y))
low₂(n, nil) -> nil
low₂(n, add₂(m, x)) -> if_low₃(le₂(m, n), n, add₂(m, x))
if_low₃(true, n, add₂(m, x)) -> add₂(m, low₂(n, x))
if_low₃(false, n, add₂(m, x)) -> low₂(n, x)
high₂(n, nil) -> nil
high₂(n, add₂(m, x)) -> if_high₃(le₂(m, n), n, add₂(m, x))
if_high₃(true, n, add₂(m, x)) -> high₂(n, x)
if_high₃(false, n, add₂(m, x)) -> add₂(m, high₂(n, x))
quicksort₁(nil) -> nil
quicksort₁(add₂(n, x)) -> app₂(quicksort₁(low₂(n, x)), add₂(n, quicksort₁(high₂(n, x))))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The approximation of the Dependency Graph [13,14,18] contains 0 SCCs with 1 less node.

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

        ↳ AND

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

            ↳ QDPOrderProof

          ↳ QDP

          ↳ QDP

          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

LOW₂(n, add₂(m, x)) -> IF_LOW₃(le₂(m, n), n, add₂(m, x))
IF_LOW₃(true, n, add₂(m, x)) -> LOW₂(n, x)
IF_LOW₃(false, n, add₂(m, x)) -> LOW₂(n, x)

The TRS R consists of the following rules:

minus₂(x, 0) -> x
minus₂(s₁(x), s₁(y)) -> minus₂(x, y)
quot₂(0, s₁(y)) -> 0
quot₂(s₁(x), s₁(y)) -> s₁(quot₂(minus₂(x, y), s₁(y)))
le₂(0, y) -> true
le₂(s₁(x), 0) -> false
le₂(s₁(x), s₁(y)) -> le₂(x, y)
app₂(nil, y) -> y
app₂(add₂(n, x), y) -> add₂(n, app₂(x, y))
low₂(n, nil) -> nil
low₂(n, add₂(m, x)) -> if_low₃(le₂(m, n), n, add₂(m, x))
if_low₃(true, n, add₂(m, x)) -> add₂(m, low₂(n, x))
if_low₃(false, n, add₂(m, x)) -> low₂(n, x)
high₂(n, nil) -> nil
high₂(n, add₂(m, x)) -> if_high₃(le₂(m, n), n, add₂(m, x))
if_high₃(true, n, add₂(m, x)) -> high₂(n, x)
if_high₃(false, n, add₂(m, x)) -> add₂(m, high₂(n, x))
quicksort₁(nil) -> nil
quicksort₁(add₂(n, x)) -> app₂(quicksort₁(low₂(n, x)), add₂(n, quicksort₁(high₂(n, x))))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13].

The following pairs can be oriented strictly and are deleted.

IF_LOW₃(true, n, add₂(m, x)) -> LOW₂(n, x)
IF_LOW₃(false, n, add₂(m, x)) -> LOW₂(n, x)

The remaining pairs can at least be oriented weakly.

LOW₂(n, add₂(m, x)) -> IF_LOW₃(le₂(m, n), n, add₂(m, x))

Used ordering: Polynomial interpretation [21]:

POL(0) = 0
POL(IF_LOW₃(x₁, x₂, x₃)) = x₃
POL(LOW₂(x₁, x₂)) = x₂
POL(add₂(x₁, x₂)) = 1 + x₂
POL(false) = 0
POL(le₂(x₁, x₂)) = 0
POL(s₁(x₁)) = 0
POL(true) = 0

The following usable rules [14] were oriented: none

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

        ↳ AND

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

            ↳ QDPOrderProof

              ↳ QDP

                ↳ DependencyGraphProof

          ↳ QDP

          ↳ QDP

          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

LOW₂(n, add₂(m, x)) -> IF_LOW₃(le₂(m, n), n, add₂(m, x))

The TRS R consists of the following rules:

minus₂(x, 0) -> x
minus₂(s₁(x), s₁(y)) -> minus₂(x, y)
quot₂(0, s₁(y)) -> 0
quot₂(s₁(x), s₁(y)) -> s₁(quot₂(minus₂(x, y), s₁(y)))
le₂(0, y) -> true
le₂(s₁(x), 0) -> false
le₂(s₁(x), s₁(y)) -> le₂(x, y)
app₂(nil, y) -> y
app₂(add₂(n, x), y) -> add₂(n, app₂(x, y))
low₂(n, nil) -> nil
low₂(n, add₂(m, x)) -> if_low₃(le₂(m, n), n, add₂(m, x))
if_low₃(true, n, add₂(m, x)) -> add₂(m, low₂(n, x))
if_low₃(false, n, add₂(m, x)) -> low₂(n, x)
high₂(n, nil) -> nil
high₂(n, add₂(m, x)) -> if_high₃(le₂(m, n), n, add₂(m, x))
if_high₃(true, n, add₂(m, x)) -> high₂(n, x)
if_high₃(false, n, add₂(m, x)) -> add₂(m, high₂(n, x))
quicksort₁(nil) -> nil
quicksort₁(add₂(n, x)) -> app₂(quicksort₁(low₂(n, x)), add₂(n, quicksort₁(high₂(n, x))))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The approximation of the Dependency Graph [13,14,18] contains 0 SCCs with 1 less node.

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

        ↳ AND

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

            ↳ QDPOrderProof

          ↳ QDP

          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

QUICKSORT₁(add₂(n, x)) -> QUICKSORT₁(low₂(n, x))
QUICKSORT₁(add₂(n, x)) -> QUICKSORT₁(high₂(n, x))

The TRS R consists of the following rules:

minus₂(x, 0) -> x
minus₂(s₁(x), s₁(y)) -> minus₂(x, y)
quot₂(0, s₁(y)) -> 0
quot₂(s₁(x), s₁(y)) -> s₁(quot₂(minus₂(x, y), s₁(y)))
le₂(0, y) -> true
le₂(s₁(x), 0) -> false
le₂(s₁(x), s₁(y)) -> le₂(x, y)
app₂(nil, y) -> y
app₂(add₂(n, x), y) -> add₂(n, app₂(x, y))
low₂(n, nil) -> nil
low₂(n, add₂(m, x)) -> if_low₃(le₂(m, n), n, add₂(m, x))
if_low₃(true, n, add₂(m, x)) -> add₂(m, low₂(n, x))
if_low₃(false, n, add₂(m, x)) -> low₂(n, x)
high₂(n, nil) -> nil
high₂(n, add₂(m, x)) -> if_high₃(le₂(m, n), n, add₂(m, x))
if_high₃(true, n, add₂(m, x)) -> high₂(n, x)
if_high₃(false, n, add₂(m, x)) -> add₂(m, high₂(n, x))
quicksort₁(nil) -> nil
quicksort₁(add₂(n, x)) -> app₂(quicksort₁(low₂(n, x)), add₂(n, quicksort₁(high₂(n, x))))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13].

The following pairs can be oriented strictly and are deleted.

QUICKSORT₁(add₂(n, x)) -> QUICKSORT₁(low₂(n, x))
QUICKSORT₁(add₂(n, x)) -> QUICKSORT₁(high₂(n, x))

The remaining pairs can at least be oriented weakly.
none
Used ordering: Polynomial interpretation [21]:

POL(0) = 0
POL(QUICKSORT₁(x₁)) = 1 + x₁
POL(add₂(x₁, x₂)) = 1 + x₂
POL(false) = 0
POL(high₂(x₁, x₂)) = x₂
POL(if_high₃(x₁, x₂, x₃)) = x₃
POL(if_low₃(x₁, x₂, x₃)) = x₃
POL(le₂(x₁, x₂)) = 0
POL(low₂(x₁, x₂)) = x₂
POL(nil) = 0
POL(s₁(x₁)) = 0
POL(true) = 0

The following usable rules [14] were oriented:

if_high₃(false, n, add₂(m, x)) -> add₂(m, high₂(n, x))
low₂(n, add₂(m, x)) -> if_low₃(le₂(m, n), n, add₂(m, x))
if_low₃(false, n, add₂(m, x)) -> low₂(n, x)
high₂(n, nil) -> nil
if_low₃(true, n, add₂(m, x)) -> add₂(m, low₂(n, x))
low₂(n, nil) -> nil
high₂(n, add₂(m, x)) -> if_high₃(le₂(m, n), n, add₂(m, x))
if_high₃(true, n, add₂(m, x)) -> high₂(n, x)

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

        ↳ AND

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

            ↳ QDPOrderProof

              ↳ QDP

                ↳ PisEmptyProof

          ↳ QDP

          ↳ QDP

Q DP problem:
P is empty.
The TRS R consists of the following rules:

minus₂(x, 0) -> x
minus₂(s₁(x), s₁(y)) -> minus₂(x, y)
quot₂(0, s₁(y)) -> 0
quot₂(s₁(x), s₁(y)) -> s₁(quot₂(minus₂(x, y), s₁(y)))
le₂(0, y) -> true
le₂(s₁(x), 0) -> false
le₂(s₁(x), s₁(y)) -> le₂(x, y)
app₂(nil, y) -> y
app₂(add₂(n, x), y) -> add₂(n, app₂(x, y))
low₂(n, nil) -> nil
low₂(n, add₂(m, x)) -> if_low₃(le₂(m, n), n, add₂(m, x))
if_low₃(true, n, add₂(m, x)) -> add₂(m, low₂(n, x))
if_low₃(false, n, add₂(m, x)) -> low₂(n, x)
high₂(n, nil) -> nil
high₂(n, add₂(m, x)) -> if_high₃(le₂(m, n), n, add₂(m, x))
if_high₃(true, n, add₂(m, x)) -> high₂(n, x)
if_high₃(false, n, add₂(m, x)) -> add₂(m, high₂(n, x))
quicksort₁(nil) -> nil
quicksort₁(add₂(n, x)) -> app₂(quicksort₁(low₂(n, x)), add₂(n, quicksort₁(high₂(n, x))))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The TRS P is empty. Hence, there is no (P,Q,R) chain.

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

        ↳ AND

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

            ↳ QDPOrderProof

          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

MINUS₂(s₁(x), s₁(y)) -> MINUS₂(x, y)

The TRS R consists of the following rules:

minus₂(x, 0) -> x
minus₂(s₁(x), s₁(y)) -> minus₂(x, y)
quot₂(0, s₁(y)) -> 0
quot₂(s₁(x), s₁(y)) -> s₁(quot₂(minus₂(x, y), s₁(y)))
le₂(0, y) -> true
le₂(s₁(x), 0) -> false
le₂(s₁(x), s₁(y)) -> le₂(x, y)
app₂(nil, y) -> y
app₂(add₂(n, x), y) -> add₂(n, app₂(x, y))
low₂(n, nil) -> nil
low₂(n, add₂(m, x)) -> if_low₃(le₂(m, n), n, add₂(m, x))
if_low₃(true, n, add₂(m, x)) -> add₂(m, low₂(n, x))
if_low₃(false, n, add₂(m, x)) -> low₂(n, x)
high₂(n, nil) -> nil
high₂(n, add₂(m, x)) -> if_high₃(le₂(m, n), n, add₂(m, x))
if_high₃(true, n, add₂(m, x)) -> high₂(n, x)
if_high₃(false, n, add₂(m, x)) -> add₂(m, high₂(n, x))
quicksort₁(nil) -> nil
quicksort₁(add₂(n, x)) -> app₂(quicksort₁(low₂(n, x)), add₂(n, quicksort₁(high₂(n, x))))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13].

The following pairs can be oriented strictly and are deleted.

MINUS₂(s₁(x), s₁(y)) -> MINUS₂(x, y)

The remaining pairs can at least be oriented weakly.
none
Used ordering: Polynomial interpretation [21]:

POL(MINUS₂(x₁, x₂)) = x₁
POL(s₁(x₁)) = 1 + x₁

The following usable rules [14] were oriented: none

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

        ↳ AND

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

            ↳ QDPOrderProof

              ↳ QDP

                ↳ PisEmptyProof

          ↳ QDP

Q DP problem:
P is empty.
The TRS R consists of the following rules:

minus₂(x, 0) -> x
minus₂(s₁(x), s₁(y)) -> minus₂(x, y)
quot₂(0, s₁(y)) -> 0
quot₂(s₁(x), s₁(y)) -> s₁(quot₂(minus₂(x, y), s₁(y)))
le₂(0, y) -> true
le₂(s₁(x), 0) -> false
le₂(s₁(x), s₁(y)) -> le₂(x, y)
app₂(nil, y) -> y
app₂(add₂(n, x), y) -> add₂(n, app₂(x, y))
low₂(n, nil) -> nil
low₂(n, add₂(m, x)) -> if_low₃(le₂(m, n), n, add₂(m, x))
if_low₃(true, n, add₂(m, x)) -> add₂(m, low₂(n, x))
if_low₃(false, n, add₂(m, x)) -> low₂(n, x)
high₂(n, nil) -> nil
high₂(n, add₂(m, x)) -> if_high₃(le₂(m, n), n, add₂(m, x))
if_high₃(true, n, add₂(m, x)) -> high₂(n, x)
if_high₃(false, n, add₂(m, x)) -> add₂(m, high₂(n, x))
quicksort₁(nil) -> nil
quicksort₁(add₂(n, x)) -> app₂(quicksort₁(low₂(n, x)), add₂(n, quicksort₁(high₂(n, x))))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The TRS P is empty. Hence, there is no (P,Q,R) chain.

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

        ↳ AND

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

            ↳ QDPOrderProof

Q DP problem:
The TRS P consists of the following rules:

QUOT₂(s₁(x), s₁(y)) -> QUOT₂(minus₂(x, y), s₁(y))

The TRS R consists of the following rules:

minus₂(x, 0) -> x
minus₂(s₁(x), s₁(y)) -> minus₂(x, y)
quot₂(0, s₁(y)) -> 0
quot₂(s₁(x), s₁(y)) -> s₁(quot₂(minus₂(x, y), s₁(y)))
le₂(0, y) -> true
le₂(s₁(x), 0) -> false
le₂(s₁(x), s₁(y)) -> le₂(x, y)
app₂(nil, y) -> y
app₂(add₂(n, x), y) -> add₂(n, app₂(x, y))
low₂(n, nil) -> nil
low₂(n, add₂(m, x)) -> if_low₃(le₂(m, n), n, add₂(m, x))
if_low₃(true, n, add₂(m, x)) -> add₂(m, low₂(n, x))
if_low₃(false, n, add₂(m, x)) -> low₂(n, x)
high₂(n, nil) -> nil
high₂(n, add₂(m, x)) -> if_high₃(le₂(m, n), n, add₂(m, x))
if_high₃(true, n, add₂(m, x)) -> high₂(n, x)
if_high₃(false, n, add₂(m, x)) -> add₂(m, high₂(n, x))
quicksort₁(nil) -> nil
quicksort₁(add₂(n, x)) -> app₂(quicksort₁(low₂(n, x)), add₂(n, quicksort₁(high₂(n, x))))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13].

The following pairs can be oriented strictly and are deleted.

QUOT₂(s₁(x), s₁(y)) -> QUOT₂(minus₂(x, y), s₁(y))

The remaining pairs can at least be oriented weakly.
none
Used ordering: Polynomial interpretation [21]:

POL(0) = 0
POL(QUOT₂(x₁, x₂)) = 1 + x₁
POL(minus₂(x₁, x₂)) = x₁
POL(s₁(x₁)) = 1 + x₁

The following usable rules [14] were oriented:

minus₂(s₁(x), s₁(y)) -> minus₂(x, y)
minus₂(x, 0) -> x

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

        ↳ AND

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

            ↳ QDPOrderProof

              ↳ QDP

                ↳ PisEmptyProof

Q DP problem:
P is empty.
The TRS R consists of the following rules:

minus₂(x, 0) -> x
minus₂(s₁(x), s₁(y)) -> minus₂(x, y)
quot₂(0, s₁(y)) -> 0
quot₂(s₁(x), s₁(y)) -> s₁(quot₂(minus₂(x, y), s₁(y)))
le₂(0, y) -> true
le₂(s₁(x), 0) -> false
le₂(s₁(x), s₁(y)) -> le₂(x, y)
app₂(nil, y) -> y
app₂(add₂(n, x), y) -> add₂(n, app₂(x, y))
low₂(n, nil) -> nil
low₂(n, add₂(m, x)) -> if_low₃(le₂(m, n), n, add₂(m, x))
if_low₃(true, n, add₂(m, x)) -> add₂(m, low₂(n, x))
if_low₃(false, n, add₂(m, x)) -> low₂(n, x)
high₂(n, nil) -> nil
high₂(n, add₂(m, x)) -> if_high₃(le₂(m, n), n, add₂(m, x))
if_high₃(true, n, add₂(m, x)) -> high₂(n, x)
if_high₃(false, n, add₂(m, x)) -> add₂(m, high₂(n, x))
quicksort₁(nil) -> nil
quicksort₁(add₂(n, x)) -> app₂(quicksort₁(low₂(n, x)), add₂(n, quicksort₁(high₂(n, x))))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The TRS P is empty. Hence, there is no (P,Q,R) chain.